Proofs of Correctness in Mathematics and Industry
نویسنده
چکیده
Quality of a product needs verification. If the product is complex, this verification cannot be done “by hand”, but one needs tools. How then are those tools being checked? Eventually quality comes from a careful specification and design methodology. Warranty is based on a mathematical proof that the design meets its specification. As mathematical proofs become long and complex themselves, we also need a tool to verify proofs. In order to prevent an infinite regress, this last tool must have a basic simplicity. Indeed, mathematical assistants that help users to develop and verify proofs are build on the current foundational logical systems that can be described in a couple of pages. It is expected that within a couple of decades, the use of reliable mathematical assistants will be widespread and will help the human user to learn, develop, teach, communicate, referee, and apply mathematics. Computerverified correctness will probably become one of the most important applications of mathematics and computer science.
منابع مشابه
A Visualization System for Correctness Proofs of Graph Algorithms
In this paper we describe a system for visualizing correctness proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm for finding a minimum spanning tree of an undirected, weighted graph. We believe that our system is particularly appropriate for greedy algorithms, though much of what we discuss can guide visualization of proofs in other contexts. ...
متن کاملTowards the Formal Certification of a Mathematical Encyclopedia on the Web
The last decade has seen the development of large bodies of online digitalized mathematical knowledge. The Dynamic Dictionary of Mathematical Functions (DDMF) [DDM] is one of these web sites, on which properties of the mathematical functions are obtained interactively, by dynamically executing some computer-algebra libraries, then displaying them. This project is targeted to readers who are not...
متن کاملThe Quest for Correctness
Die Genauigkeit, Kraft und Sicherheit dieses mathematischen] Denkens, die nir-gends im Leben ihresgleichen hat, erf ullte ihm fast mit Schwermut. 1 R. Musil 1952]: Der Mann ohne Eigenschaften. Abstract Modern society has a strong need for reliable Information Technology. To warrant correct designs for hardware and software systems, there is a thorough methodology (speciication, design based on ...
متن کاملReusing Formal Proofs Through Isomorphisms Invited Talk
ABSTRACT Formalization of computational objects, software and hardware, is the unique manner to guarantee well-behavior of computer programs and hardware, at least from the mathematical and logical point of view. Several verification and testing approaches have been proved of great applicability in this area being their usability made evident through real applications in the development of crit...
متن کاملAutomatic verification and interactive theorem proving
Sommario. Automatic verification deals with the validation by means of computers of correctness certificates. The related tools, usually called proof assistant or interactive provers, provide an interactive environment for the creation of formal certificates whose correctness can be assessed in a purely automatic way. Such systems have applications both in mathematics, where certificates are pr...
متن کامل